Typechecking Z
نویسندگان
چکیده
This paper presents some of our requirements for a Z type-checker: that the typechecker accept all well-typeable formulations, however contrived; that it gather information about uses of declarations as needed to support interactive browsing and formal reasoning; that it t the description given by draft standard Z; and that it be able to check some particular extensions to Z that are intended to allow explicit dee-nitions of schema calculus operators. The paper presents a speciication of such a Z typechecker, which we have implemented.
منابع مشابه
On Typechecking B
The typechecking system of the formal method B is discussed. An inconsistency in the public definition of the B method, attributable to a flaw in the typechecking system, is uncovered: the typechecking method expects the types of variables to be given in one membership predicate, such as a, b, c ∈ A × B × C, instead of with several membership predicates joined by conjunction, like a ∈ A∧b ∈ B∧c...
متن کاملCZT: A Framework for Z Tools
The Community Z Tools (CZT) project is an open-source Java framework for building formal methods tools for Z and Z dialects. It also includes a set of tools for parsing, typechecking, transforming and printing standard Z specifications in LTEX, Unicode or XML formats. This paper gives an overview of the CZT framework, including an introduction to its visitor design pattern that makes it possibl...
متن کاملXML Typechecking
SYNONYMS None DEFINITION In general, typechecking refers to the problem where, given a program P , an input type σ, and an output type τ , one must decide whether P is type-safe, that is, whether it produces only outputs of type τ when run on inputs of type σ. In the XML context, typechecking problems mainly arise in two forms: • • XML-to-XML transformations, where P transforms XML documents co...
متن کاملPerformance polymorphism
In an interactive functional programming environment with a Milner-style polymorphic type system (Milner 1978), a modification to one definition may imply changes in the types of other definitions. A polymorphic typechecker must carry out some re-typechecking to determine all of these changes. This paper presents a new typechecking algorithm which performs fine-grained re-typechecking based on ...
متن کاملTowards Practical Typechecking for Macro Tree Transducers
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step toward an implementation of mtt typechecker that has a practical efficiency. Our approach is to represent an input type obtained from a backward inference as an alternating tree automaton, in a style similar to Tozawa’s X...
متن کامل